package 算法.NiuKe.JZ;

import java.util.Stack;

/**
 * @author: 谢君臣
 * @create: 2021-01-25 20:40
 * @founction: XXXX
 *  用两个栈来实现一个队列，完成队列的Push和Pop操作。 队列中的元素为int类型。
 */
public class JZ5 {
    public static void main(String[] args) {
        push(1);
        push(2);
        push(3);
        System.out.println(pop());
        System.out.println(pop());
        System.out.println(pop());
        System.out.println(pop());

    }
    public static Stack<Integer> stack1 = new Stack<Integer>();
    public static Stack<Integer> stack2 = new Stack<Integer>();

    public static void push(int node) {
        stack1.push(node);
    }

    public static int pop() {
        if (stack2.empty()){
            if (stack1.empty())
                throw new RuntimeException("The queue is empty!");
            else
                while (!stack1.empty())
                    stack2.push(stack1.pop());
        }
        return stack2.pop();
    }
}
